Computer Science and Engineering

Automata and Formal Languages - I
  1. Language acceptance for Deterministic Finite Automaton (DFA)
  2. Language acceptance for NFAs
  3. Converting NFA to DFA
  4. Converting Regular Expression to NFA
  5. Conversion from NFA to RE
  6. DFA Minimization and Equivalence
  7. Acceptance of string by Pushdown Automaton
  8. Derivation from a Context-Free Grammar